A Geometric Algorithm for Finding the Maximal Cutter for 2-d Milling Operations

نویسندگان

  • Zhiyang Yao
  • Satyandra K. Gupta
  • Dana S. Nau
چکیده

In this paper, we present a geometric algorithm of finding the maximal cutter for 2-D milling operations. Our algorithm works not only for the common closed pocket problem, but also for the general 2-D milling problems with open edges. We define the general 2-D milling process in terms of a “target region” to be machined and an “obstruction region” that should not intersect with the cutter during machining. Our algorithm finds the largest cutter that can cover the target region without interfering with the obstruction region. Finding the biggest cutter is expected to help in the selection of the right sets of tools and the right type of cutter trajectories, and thereby ensure high production rate and meet the required quality level.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Geometric Algorithm for Finding the Largest Milling Cutter

In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2-D milling operations to be performed using a single cutter. In particular: 1. We give a general definition of the problem as the task of covering a target region without interfering with an obstruction region. This definition encompasses the task of milling a general 2-D profile that include...

متن کامل

Geometric algorithms for computing cutter engagement functions in 2.5D milling operations

Geometric algorithms for computing cutter engagement functions in 2.5D milling operations. ABSTRACT Cutter engagement is a measure that describes what portion of the cutter is involved in machining at a given instant of time. During profile milling of complex geometries, cutter engagement varies significantly along the cutter path. Cutter engagement information helps in determining the efficien...

متن کامل

Algorithms for selecting cutters in multi-part milling problems

This paper describes geometric algorithms for automatically selecting an optimal sequence of cutters for machining a set of 21⁄2D parts. In milling operations, cutter size affects the machining time significantly. Meanwhile, if the batch size is small, it is also important to shorten the time spent on loading tools into the tool magazine and establishing z-length compensation values. Therefore,...

متن کامل

An Instantaneous Rigid Force Model For 3-Axis Ball-End Milling Of Sculptured Surfaces

An instantaneous rigid force model for prediction of cutting forces in ball-end milling of  sculptured surfaces is presented in this paper. A commercially available geometric engine is used to represent the cutting edge, cutter and updated part geometries. The cutter used in this work is an insert type ball-end mill. Intersecting an inclined plane with the cutter ball nose generates the cutting...

متن کامل

Finding the Maximal Cutter for 2-d Milling Operations

NC machining is being used to create increasingly complex shapes. These complex shapes are used in a variety of defense, aerospace, and automotive applications to (1) provide performance improvements, and (2) create high performance tooling (e.g., molds for injection molding). The importance of the machining process is increasing due to latest advances in high speed machining that allows machin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000